oalib

OALib Journal期刊

ISSN: 2333-9721

费用：99美元

投稿

时间不限

( 2673 )

( 2672 )

( 2454 )

( 2208 )

自定义范围…

匹配条件： “ Meenakshi V. Rele and Lalitha Sunil Kumar” ，找到相关结果约180612条。
列表显示的所有文章，均可免费获取
第1页/共180612条
每页显示 条
Cloning and Sequence Analysis of the Amylase Gene from the Rice Pest Scirpophaga Incertulas Walker and its Inhibitor from Wheat (Variety MP Sehore)
Poonam Sharma, Pallavi R. Shankar, Geetha Subramaniam, Amit Kumar, Aanchal Tandon, C.G. Suresh, Meenakshi V. Rele and Lalitha Sunil Kumar
International Journal of Insect Science , 2012,
Abstract: Scirpophaga incertulas Walker (Lepidoptera: Pyralideae), commonly known as yellow stem borer, is a predominant monophagous pest of rice, which causes 5% to 30% loss of the rice crop. We report for the first time, the cloning and sequence analysis of the amylase gene of this pest. The cloned gene translates into a protein of 487 amino acids having a predicted molecular weight of 54,955 daltons and a theoretical pI of 5.9. The 3D structure of the amylase is predicted from its amino acid sequence by homology modeling using the structure of the amylase from Tenebrio molitor L (Coleoptera: Tenebrionidae). We also report the purification of a dimeric α-amylase inhibitor from a local variety of wheat MP Sehore that is specific for the amylase of this pest and does not inhibit human salivary amylase or porcine pancreatic amylase. The gene encoding this inhibitor has been cloned and its sequence has been analysed to find a possible explanation for this specificity.
Codes with Locality for Two Erasures
N. Prakash,V. Lalitha,P. Vijay Kumar
Computer Science , 2014,
Abstract: In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated to small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan \textit{et al}, in which recovery from a single erasure is considered. By studying the Generalized Hamming Weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Tur\'an graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from $2$ erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.
Pharmacognostical and Phytochemical Studies of Helleborus niger L Root
K. G. Lalitha,V. Kishor Kumar
- , 2017, DOI: 10.4103/asl.ASL_57_16
Abstract: Helleborus niger L (Ranunculaceae) is used Ayurvedic and Unani systems and other herbal medicine systems. The roots of H. niger have a good medicinal value
Characterization and dielectric properties of almandine-pyrope garnet
K Krishna Kumar,Lalitha Sirdeshmukh,V Balaram
- , 1992,
Abstract:
Size-dependent magnetization fluctuations in NiO nanoparticles
Sunil Kumar Mishra,V. Subrahmanyam
Physics , 2008, DOI: 10.1142/S0217979211100035
Abstract: The finite size and surface roughness effects on the magnetization of NiO nanoparticles is investigated. A large magnetic moment arises for an antiferromagnetic nanoparticle due to these effects. The magnetic moment without the surface roughness has a non-monotonic and oscillatory dependence on $R$, the size of the particles, with the amplitude of the fluctuations varying linearly with $R$. The geometry of the particle also matters a lot in the calculation of the net magnetic moment. An oblate spheroid shape particle shows an increase in net magnetic moment by increasing oblateness of the particle. However, the magnetic moment values thus calculated are very small compared to the experimental values for various sizes, indicating that the bulk antiferromagnetic structure may not hold near the surface. We incorporate the surface roughness in two different ways; an ordered surface with surface spins inside a surface roughness shell aligned due to an internal field, and a disordered surface with randomly oriented spins inside surface roughness shell. Taking a variational approach we find that the core interaction strength is modified for nontrivial values of $\Delta$ which is a signature of multi-sublattice ordering for nanoparticles. The surface roughness scale $\Delta $ is also showing size dependent fluctuations, with an envelope decay $\Delta\sim R^{-1/5}$. The net magnetic moment values calculated using spheroidal shape and ordered surface are close to the experimental values for different sizes.
Slow dynamics of interacting antiferromagnetic nanoparticles
Sunil Kumar Mishra,V. Subrahmanyam
Physics , 2011, DOI: 10.1103/PhysRevB.84.024429
Abstract: We study magnetic relaxation dynamics, memory and aging effects in interacting polydisperse antiferromagnetic NiO nanoparticles by solving a master equation using a two-state model. We investigate the effects of interactions using dipolar, Nearest-Neighbour Short-Range (NNSR) and Long-Range Mean-Field (LRMF) interactions. The magnetic relaxation of the nanoparticles in a time-dependent magnetic field has been studied using LRMF interaction. The size-dependent effects are suppressed in the ac-susceptibility, as the frequency is increased. We find that the memory dip, that quantifies the memory effect is about the same as that of non-interacting nanoparticles for the NNSR case. There is a stronger memory-dip for LRMF, and a weaker memory-dip for the dipolar interactions. We have also shown a memory effect in the Zero-field-cooled magnetization for the dipolar case, a signature of glassy behaviour, from Monte-Carlo studies.
DMT of Wireless Networks: An Overview (Invited Paper)
K. Vinodh,N. Prakash,V. Lalitha,P. Vijay Kumar
Journal of Communications , 2010, DOI: 10.4304/jcm.5.4.265-281
Abstract: The efficient operation of single-source, single-sink wireless networks is considered with the diversity-multiplexing gain tradeoff (DMT) as the measure of performance. Whereas in the case of a point-to-point MIMO channel the DMT is determined by the fading statistics, in the case of a network, the DMT is additionally, a function of the time schedule according to which the network is operated, as well as the protocol that dictates the mode of operation of the intermediate relays. In general, it is only possible at present, to provide upper bounds on the DMT of the network in terms of the DMT of the MIMO channel appearing across cuts in the network. This paper presents a tutorial overview on the DMT of half-duplex multi-hop wireless networks that also attempts to identify where possible, codes that achieve the DMT. For example, it is shown how one can construct codes that achieve the DMT of a network under a given schedule and either an amplify-and-forward or decode-andforward protocol. Also contained in the paper, are discussions on the DMT of the multiple-access channel as well as the impact of feedback on the DMT of a MIMO channel.
Codes with Local Regeneration
Govinda M. Kamath,N. Prakash,V. Lalitha,P. Vijay Kumar
Mathematics , 2012,
Abstract: Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. In this paper, we provide several constructions for a class of vector codes with locality in which the local codes are regenerating codes, that enjoy both advantages. We derive an upper bound on the minimum distance of this class of codes and show that the proposed constructions achieve this bound. The constructions include both the cases where the local regenerating codes correspond to the MSR as well as the MBR point on the storage-repair-bandwidth tradeoff curve of regenerating codes. Also included is a performance comparison of various code constructions for fixed block length and minimum distance.
Optimal Linear Codes with a Local-Error-Correction Property
N. Prakash,Govinda M. Kamath,V. Lalitha,P. Vijay Kumar
Mathematics , 2012,
Abstract: Motivated by applications to distributed storage, Gopalan \textit{et al} recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such "local" parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.
Removal of Methylene Blue from Aqueous Effluent Using Fixed Bed of Groundnut Shell Powder
Sunil Kumar,V. Gunasekar,V. Ponnusami
Journal of Chemistry , 2013, DOI: 10.1155/2013/259819
Abstract:
第1页/共180612条
每页显示 条


Home
Copyright © 2008-2020 Open Access Library. All rights reserved.